Kernel Based Text-independnent Speaker Verification
نویسندگان
چکیده
The goal of a person authentication system is to authenticate the claimed identity of a user. When this authentication is based on the voice of the user, without respect of what the user exactly said, the system is called a text-independent speaker verification system. Speaker verification systems are increasingly often used to secure personal information, particularly for mobile phone based applications. Furthermore, text-independent versions of speaker verification systems are the most used for their simplicity, as they do not require complex speech recognition modules. The most common approach to this task is based on Gaussian Mixture Models (GMMs) (Reynolds et al. 2000), which do not take into account any temporal information. GMMs have been intensively used thanks to their good performance, especially with the use of the Maximum A Posteriori (MAP) (Gauvain and Lee 1994) adaptation algorithm. This approach is based on the density estimation of an impostor data distribution, followed by its adaptation to a specific client data set. Note that the estimation of these densities is not the final goal of speaker verification systems, which is rather to discriminate the client and impostor classes; hence discriminative approaches might appear good candidates for this task as well. As a matter of fact, Support Vector Machine (SVM) based systems have been the subject of several recent publications in the speaker verification community, in which they obtain similar to or even better performance than GMMs on several text-independent speaker
منابع مشابه
A kernel trick for sequences applied to text-independent speaker verification systems
This paper present a principled SVM based speaker verification system. We propose a new framework and a new sequence kernel that can make use of any Mercer kernel at the frame level. An extension of the sequence kernel based on the Max operator is also proposed. The new system is compared to state-of-the-art GMM and other SVM based systems found in the literature on the Banca and Polyvar databa...
متن کاملKernel Alignment Maximization for Speaker Recognition Based on High-Level Features
In this paper text-independent automatic speaker verification based on support vector machines is considered. A generalized linear kernel training method based on kernel alignment maximization is proposed. First, kernel matrix decomposition into a sum of maximally aligned directions in the input space is performed and this decomposition is spectrally optimized. The method was evaluated for high...
متن کاملA Max Kernel For Text-Independent Speaker Verification Systems
In this paper, we present a principled SVM based speaker verification system. A general approach to compute two sequences of frames is developed that enables the use of any kernel at the frame level. An extension of this approach using the Max operator is then proposed. The new system is compared to state-of-the-art GMM and other SVM based systems found in the literature on the Polyvar database...
متن کاملCompensations for SVM in Text-Independent Speaker Verification
Support Vector Machines (SVMs) technique, as a kind of pattern classifier, is widely used in pattern classification including speaker verification. We study the asymmetrical character of speaker verification that uses SVM since the asymmetry between true and imposter speaker training sets degrade recognition rate. Asymmetrical costs kernel is implemented and based on it, we introduce a new meth...
متن کامل